| 1 |
A Multitask Learning Framework for Abuse Detection and Emotion Classification
|
|
|
|
In: Algorithms; Volume 15; Issue 4; Pages: 116 (2022)
|
|
BASE
|
|
Show details
|
|
|
| 2 |
into Lightweight Ontologies
|
|
|
|
In: http://eprints.biblio.unitn.it/1835/1/025.pdf (2010)
|
|
BASE
|
|
Show details
|
|
|
| 3 |
General Terms
|
|
|
|
In: http://eprints.biblio.unitn.it/1507/1/061.pdf (2008)
|
|
BASE
|
|
Show details
|
|
|
| 4 |
Lightweight Ontologies
|
|
|
|
In: http://eprints.biblio.unitn.it/archive/00001289/01/071.pdf (2007)
|
|
Abstract:
Ontologies are explicit specifications of conceptualizations [8]. They are often thought of as directed graphs whose nodes represent concepts and whose edges represent relations between concepts. The notion of concept is understood as defined in Knowledge Representation, i.e., as a set of objects or individuals [2]. This set is called the concept extension or the concept interpretation. Concepts are often lexically defined, i.e., they have natural language names which are used to describe the concept extensions (e.g., concept mother denotes the set of all female parents). Therefore, when ontologies are visualized, their nodes are often shown with corresponding natural language concept names. The backbone structure of the ontology graph is a taxonomy in which the relations are “is-a”, whereas the remaining structure of the graph supplies auxiliary information about the modeled domain and may include relations like “part-of”, “located-in”, “is-parent-of”, and many others [9]. In their simplest version, one can think of lightweight ontologies as ontologies consisting of backbone taxonomies only. However, we generalize the “is-a ” relationship to concept subsumption still matching the basic properties of backbone taxonomies: namely, in a lightweight ontology, the extension of the concept of a child node is a subset of the extension of the concept of the parent node. We formally define the notion of lightweight ontology as: A (formal) lightweight ontology is a triple O = 〈N, E, C〉, where N is a finite set of nodes, E is a set of edges on N, such that 〈N, E 〉 is a rooted tree, and C is a finite set of concepts expressed in a formal language F, such that
|
|
Keyword:
Business catalogues; Controlled vocabularies; Faceted classifications; Taxonomies; Thesauri; Topic hierarchies; User classifications DEFINITION; Web directories
|
|
URL: http://eprints.biblio.unitn.it/archive/00001289/01/071.pdf
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.1717
|
|
BASE
|
|
Hide details
|
|
|
| 5 |
SEMANTIC COOPERATION AND KNOWLEDGE REUSE BY USING AUTONOMOUS ONTOLOGIES
|
|
|
|
In: http://eprints.biblio.unitn.it/1210/1/026.pdf (2007)
|
|
BASE
|
|
Show details
|
|
|
| 6 |
ScienceTreks: an Autonomous Digital Library System
|
|
|
|
In: http://eprints.biblio.unitn.it/archive/00001279/01/066.pdf (2007)
|
|
BASE
|
|
Show details
|
|
|
| 7 |
The Tropos Software Development Methodology: Processes, Models And Diagrams
|
|
|
|
In: http://dit.unitn.it/~tropos/papers_files/giu1.pdf (2002)
|
|
BASE
|
|
Show details
|
|
|
| 8 |
The tropos software development methodology: Processes
|
|
|
|
In: http://www.enel.ucalgary.ca/People/far/Lectures/SENG697/PDF/references/P04.pdf (2001)
|
|
BASE
|
|
Show details
|
|
|
| 9 |
The Tropos Software Development Methodology: Processes, Models And Diagrams
|
|
|
|
In: http://sra.itc.it/tr/GMP01.ps.gz (2001)
|
|
BASE
|
|
Show details
|
|
|
| 10 |
Local Models Semantics, or Contextual Reasoning = Locality + Compatibility
|
|
|
|
In: ftp://ftp.mrg.dist.unige.it/pub/mrg-ftp/9701-07.ps.gz (1997)
|
|
BASE
|
|
Show details
|
|
|
| 12 |
Regular Polysemy in WordNet and Pattern based Approach
|
|
|
|
In: http://www.thinkmind.org/download.php?articleid%3Dintsys_v6_n34_2013_4
|
|
BASE
|
|
Show details
|
|
|
|
|
